The parallel TASEP, fixed particle number and weighted Motzkin paths
نویسنده
چکیده
In this paper the totally asymmetric exclusion process (TASEP) with parallel update on an open lattice of size L is considered in the maximum-current region. A formal expression for the generating function for the weight of configurations with N particles is given. Further an interpretation in terms of (u, l, d)-colored weighted Motzkin paths is presented. Using previous results (Woelki and Schreckenberg 2009 J. Stat. Mech P05014, Woelki 2010 Cellular Automata, pp 637-645) the generating function is compared with the one for a possible 2nd-class particle dynamics for the parallel TASEP. It is shown that both become physically equivalent in the thermodynamic limit.
منابع مشابه
Matrix identities on weighted partial Motzkin paths
We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence (1, 4, 4, 4, . . .) which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial Motzkin paths with an elevation line and weighted free Motzkin paths, we find a matrix identity on the number of weighted Motzkin paths and the sequence (1, k, ...
متن کامل# a 49 Integers 12 ( 2012 ) Inverses of Motzkin and Schröder Paths
The connection between weighted counts of Motzkin paths and moments of orthogonal polynomials is well known. We look at the inverse generating function of Motzkin paths with weighted horizontal steps, and relate it to Chebyshev polynomials of the second kind. The inverse can be used to express the number of paths ending at a certain height in terms of those ending at height 0. Paths of a more g...
متن کاملOn Computing the Total Displacement Number via Weighted Motzkin Paths
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen [10]). The former combinatorial problem is still open. In this work we show that this connection allows to construct efficient algorithms for counting and for sampling such permutations. These algorithms provide a tool to better understand ...
متن کاملDyck Paths, Motzkin Paths, and the Binomial Transform
We study the moments of orthogonal polynomial sequences (OPS) arising from tridiagonal matrices. We obtain combinatorial information about the sequence of moments of some OPS in terms of Motzkin and Dyck paths, and also in terms of the binomial transform. We then introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of...
متن کاملPotential polynomials and Motzkin paths
Abstract. AMotzkin path of length n is a lattice path from (0, 0) to (n, 0) in the plane integer lattice Z × Z consisting of horizontal-steps (1, 0), up-steps (1, 1), and down-steps (1,−1), which never passes below the x-axis. A u-segment (resp. h-segment ) of a Motzkin path is a maximum sequence of consecutive up-steps (resp. horizontal-steps). The present paper studies two kinds of statistics...
متن کامل